Secure List Decoding and its Application to Bit-String Commitment

We propose a new concept of secure list decoding, which is related to bit-string commitment. While the conventional decoding requires that contains transmitted message, following additional security conditions work as modification The first condition receiver’s uncertainty for stronger than impossibility correct even though message contained in list. other sender estimate another element decoded except message. evaluated by equivocation rate. asymptotic property three parameters, rates and sizes, derive capacity region this problem. show combination hash function yields Our results hold when input output systems are general probability spaces including continuous systems. When system space, we formulate abilities honest dishonest different way.